________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 22:10:47
Input Data from:  dataset168.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,142666666666667
Average f[i]   :4325
Average g[i,j] :2047,05882352941
Total demand   :16340
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	8170	1	-1	6	6000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 8170


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 64
> Selected Move:	9620	1	-1	17	10000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 9620


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 63
> Selected Move:	11020	1	-1	9	16500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0    >new incumb.: 11020


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 69
> Selected Move:	12460	1	-1	13	22500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0    >new incumb.: 12460


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 46
> Selected Move:	12820	3	2	7	24600


> New Y[]: 
	
	 2  3  0  0  0  0  1  4  0  1  0  0  0  1  0  0  0  1  0  0    >new incumb.: 12820


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 51
> Selected Move:	12830	3	9	4	22600


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  0  0  0  0  0  1  0  0  0  1  0  0    >new incumb.: 12830


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 53
> Selected Move:	12830	4	7	4	22000


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 52
> Selected Move:	12830	4	4	6	20800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 54
> Selected Move:	13353	1	-1	19	25300


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 54
> Selected Move:	13270	3	6	11	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  4  0  1  0  0  0  1  0  1    >new incumb.: 13270


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 37
> Selected Move:	13270	4	11	13	24600


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  1  0  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 56
> Selected Move:	13332	3	19	14	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  1  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 38
> Selected Move:	13145	4	13	11	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  4  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 38
> Selected Move:	13020	3	11	2	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 55
> Selected Move:	13300	3	7	11	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0    >new incumb.: 13300


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 58
> Selected Move:	13333	3	14	6	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 51
> Selected Move:	13275	3	6	3	25500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 17 #######################


> Neighbours evaluated; 49
> Selected Move:	13130	3	3	19	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 18 #######################


> Neighbours evaluated; 65
> Selected Move:	13130	3	11	3	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 19 #######################


> Neighbours evaluated; 62
> Selected Move:	13130	3	3	6	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 20 #######################


> Neighbours evaluated; 74
> Selected Move:	13130	3	19	7	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 21 #######################


> Neighbours evaluated; 48
> Selected Move:	13130	3	6	3	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 22 #######################


> Neighbours evaluated; 55
> Selected Move:	13000	3	4	18	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 23 #######################


> Neighbours evaluated; 91
> Selected Move:	13040	3	7	11	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 24 #######################


> Neighbours evaluated; 83
> Selected Move:	13100	3	3	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 25 #######################


> Neighbours evaluated; 85
> Selected Move:	13100	3	6	14	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 26 #######################


> Neighbours evaluated; 98
> Selected Move:	12890	3	11	7	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 27 #######################


> Neighbours evaluated; 86
> Selected Move:	13000	3	14	6	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 28 #######################


> Neighbours evaluated; 96
> Selected Move:	12990	3	17	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 29 #######################


> Neighbours evaluated; 92
> Selected Move:	12990	3	6	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 30 #######################


> Neighbours evaluated; 97
> Selected Move:	12920	3	18	4	25500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 31 #######################


> Neighbours evaluated; 76
> Selected Move:	12923	3	3	6	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 32 #######################


> Neighbours evaluated; 79
> Selected Move:	12840	3	7	11	26000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 33 #######################


> Neighbours evaluated; 86
> Selected Move:	13020	3	6	12	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 34 #######################


> Neighbours evaluated; 84
> Selected Move:	13020	3	10	17	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 35 #######################


> Neighbours evaluated; 44
> Selected Move:	13000	3	17	19	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 36 #######################


> Neighbours evaluated; 51
> Selected Move:	12780	3	11	14	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 37 #######################


> Neighbours evaluated; 35
> Selected Move:	12980	3	12	17	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 38 #######################


> Neighbours evaluated; 72
> Selected Move:	12990	3	0	12	25500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  2  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 39 #######################


> Neighbours evaluated; 47
> Selected Move:	13170	4	12	13	24900


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  2  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 40 #######################


> Neighbours evaluated; 55
> Selected Move:	13355	3	14	3	25900


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  1  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 41 #######################


> Neighbours evaluated; 39
> Selected Move:	13498	4	13	3	25500


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 42 #######################


> Neighbours evaluated; 47
> Selected Move:	13364	3	3	6	25900


> New Y[]: 
	
	 0  3  4  0  1  0  2  0  0  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 43 #######################


> Neighbours evaluated; 49
> Selected Move:	13369	4	6	13	25900


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  0  1  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 44 #######################


> Neighbours evaluated; 57
> Selected Move:	13220	3	6	11	24900


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 45 #######################


> Neighbours evaluated; 63
> Selected Move:	13090	3	4	18	24400


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  1  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 46 #######################


> Neighbours evaluated; 67
> Selected Move:	13090	4	13	12	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  2  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 47 #######################


> Neighbours evaluated; 64
> Selected Move:	13043	3	18	4	25500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  2  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 48 #######################


> Neighbours evaluated; 54
> Selected Move:	13130	3	11	3	26500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  2  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 49 #######################


> Neighbours evaluated; 44
> Selected Move:	13123	3	3	6	26500


> New Y[]: 
	
	 0  3  4  0  1  0  1  0  0  0  0  0  2  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 50 #######################


> Neighbours evaluated; 60
> Selected Move:	12750	3	4	18	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  2  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 51 #######################


> Neighbours evaluated; 62
> Selected Move:	12970	4	12	6	25400


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  0  0  1  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 52 #######################


> Neighbours evaluated; 69
> Selected Move:	13014	3	6	11	25200


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  2  1  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 53 #######################


> Neighbours evaluated; 65
> Selected Move:	12951	3	18	4	25700


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  2  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 54 #######################


> Neighbours evaluated; 66
> Selected Move:	12663	3	11	14	26300


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  1  2  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 55 #######################


> Neighbours evaluated; 58
> Selected Move:	12499	4	14	17	26700


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  1  1  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 56 #######################


> Neighbours evaluated; 54
> Selected Move:	12590	3	14	3	27700


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  1  1  0  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 57 #######################


> Neighbours evaluated; 48
> Selected Move:	12595	3	17	0	26000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 58 #######################


> Neighbours evaluated; 31
> Selected Move:	12875	3	19	17	25500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 59 #######################


> Neighbours evaluated; 26
> Selected Move:	12873	3	3	6	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 60 #######################


> Neighbours evaluated; 38
> Selected Move:	12860	3	6	14	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 61 #######################


> Neighbours evaluated; 37
> Selected Move:	12850	3	17	10	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 62 #######################


> Neighbours evaluated; 77
> Selected Move:	12970	3	12	11	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 63 #######################


> Neighbours evaluated; 102
> Selected Move:	12840	3	4	18	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 64 #######################


> Neighbours evaluated; 105
> Selected Move:	12870	3	14	6	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 65 #######################


> Neighbours evaluated; 89
> Selected Move:	12808	3	6	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 66 #######################


> Neighbours evaluated; 88
> Selected Move:	12720	3	18	4	26000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 67 #######################


> Neighbours evaluated; 75
> Selected Move:	12750	3	11	5	25000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 68 #######################


> Neighbours evaluated; 70
> Selected Move:	12760	3	10	17	24500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 69 #######################


> Neighbours evaluated; 54
> Selected Move:	12760	3	3	6	24500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 70 #######################


> Neighbours evaluated; 56
> Selected Move:	12760	3	5	15	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 71 #######################


> Neighbours evaluated; 58
> Selected Move:	12760	3	6	3	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 72 #######################


> Neighbours evaluated; 57
> Selected Move:	12700	3	3	11	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 73 #######################


> Neighbours evaluated; 74
> Selected Move:	12700	3	15	5	23500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 74 #######################


> Neighbours evaluated; 69
> Selected Move:	12610	3	11	14	23500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  0  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 75 #######################


> Neighbours evaluated; 60
> Selected Move:	12618	3	5	6	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 76 #######################


> Neighbours evaluated; 57
> Selected Move:	12640	3	14	10	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 77 #######################


> Neighbours evaluated; 89
> Selected Move:	12750	3	17	5	25000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 78 #######################


> Neighbours evaluated; 82
> Selected Move:	12735	3	5	19	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 79 #######################


> Neighbours evaluated; 88
> Selected Move:	12778	3	10	7	25500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 80 #######################


> Neighbours evaluated; 56
> Selected Move:	12900	3	4	17	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 81 #######################


> Neighbours evaluated; 81
> Selected Move:	12908	3	2	4	26500


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 82 #######################


> Neighbours evaluated; 45
> Selected Move:	13266	4	4	13	25600


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 83 #######################


> Neighbours evaluated; 67
> Selected Move:	13141	3	0	12	27100


> New Y[]: 
	
	 0  3  0  0  1  0  1  1  0  0  0  0  2  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 84 #######################


> Neighbours evaluated; 34
> Selected Move:	13370	4	12	6	26500


> New Y[]: 
	
	 0  3  0  0  1  0  2  1  0  0  0  0  1  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 85 #######################


> Neighbours evaluated; 37
> Selected Move:	13484	4	6	13	26200


> New Y[]: 
	
	 0  3  0  0  1  0  4  1  0  0  0  0  1  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 86 #######################


> Neighbours evaluated; 50
> Selected Move:	13232	4	13	12	26800


> New Y[]: 
	
	 0  3  0  0  1  0  4  1  0  0  0  0  2  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 87 #######################


> Neighbours evaluated; 47
> Selected Move:	12974	4	12	7	27400


> New Y[]: 
	
	 0  3  0  0  1  0  4  2  0  0  0  0  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 88 #######################


> Neighbours evaluated; 48
> Selected Move:	12836	4	6	13	27700


> New Y[]: 
	
	 0  3  0  0  1  0  1  2  0  0  0  0  1  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 89 #######################


> Neighbours evaluated; 51
> Selected Move:	12728	3	6	14	26700


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  0  0  0  1  4  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 90 #######################


> Neighbours evaluated; 41
> Selected Move:	12977	4	7	12	26100


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  0  0  0  2  4  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 91 #######################


> Neighbours evaluated; 51
> Selected Move:	12980	3	12	0	24600


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  0  4  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 92 #######################


> Neighbours evaluated; 81
> Selected Move:	13016	3	14	3	25600


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0  0  0  0  4  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 93 #######################


> Neighbours evaluated; 61
> Selected Move:	13013	4	13	3	25600


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 94 #######################


> Neighbours evaluated; 72
> Selected Move:	12945	3	19	11	26100


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  0  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 95 #######################


> Neighbours evaluated; 31
> Selected Move:	13136	3	3	6	25800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 96 #######################


> Neighbours evaluated; 34
> Selected Move:	13130	3	11	5	24800


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 97 #######################


> Neighbours evaluated; 49
> Selected Move:	13084	4	6	13	25100


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0  0  0  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 98 #######################


> Neighbours evaluated; 61
> Selected Move:	12983	3	5	11	26100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 99 #######################


> Neighbours evaluated; 34
> Selected Move:	12918	3	6	3	26100


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 100 #######################


> Neighbours evaluated; 35
> Selected Move:	12862	3	11	5	25100


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0  0  0  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 101 #######################


> Neighbours evaluated; 52
> Selected Move:	12862	4	13	3	25100


> New Y[]: 
	
	 2  3  0  4  1  1  0  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 102 #######################


> Neighbours evaluated; 59
> Selected Move:	12780	3	3	11	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0  0  4  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 103 #######################


> Neighbours evaluated; 44
> Selected Move:	12780	4	11	4	25000


> New Y[]: 
	
	 2  3  0  0  4  1  0  1  0  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 104 #######################


> Neighbours evaluated; 31
> Selected Move:	13020	3	5	19	25500


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 105 #######################


> Neighbours evaluated; 58
> Selected Move:	12875	3	19	14	26000


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  0  0  0  1  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 106 #######################


> Neighbours evaluated; 32
> Selected Move:	12870	4	4	14	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  1  0  1  4  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 107 #######################


> Neighbours evaluated; 38
> Selected Move:	12755	3	14	19	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 108 #######################


> Neighbours evaluated; 48
> Selected Move:	12698	4	19	7	26100


> New Y[]: 
	
	 2  3  0  0  1  0  0  4  0  0  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 109 #######################


> Neighbours evaluated; 55
> Selected Move:	12555	3	4	18	25600


> New Y[]: 
	
	 2  3  0  0  0  0  0  4  0  0  0  1  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 110 #######################


> Neighbours evaluated; 36
> Selected Move:	12870	4	7	11	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  4  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 111 #######################


> Neighbours evaluated; 50
> Selected Move:	12950	3	19	14	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  4  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 112 #######################


> Neighbours evaluated; 33
> Selected Move:	12950	4	11	13	24600


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  1  0  4  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 113 #######################


> Neighbours evaluated; 53
> Selected Move:	12870	3	14	19	24100


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  1  0  4  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 114 #######################


> Neighbours evaluated; 71
> Selected Move:	12770	3	19	6	25600


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  1  0  4  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 115 #######################


> Neighbours evaluated; 31
> Selected Move:	12933	4	13	6	25300


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  0  0  0  1  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 116 #######################


> Neighbours evaluated; 43
> Selected Move:	12830	3	11	4	24800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  0  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 117 #######################


> Neighbours evaluated; 86
> Selected Move:	12960	3	18	15	25300


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 118 #######################


> Neighbours evaluated; 48
> Selected Move:	12924	3	15	12	25800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 119 #######################


> Neighbours evaluated; 29
> Selected Move:	12837	3	12	10	25300


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 120 #######################


> Neighbours evaluated; 71
> Selected Move:	12946	3	17	5	25300


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 121 #######################


> Neighbours evaluated; 63
> Selected Move:	12874	3	10	19	25300


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 122 #######################


> Neighbours evaluated; 54
> Selected Move:	12860	3	13	17	23300


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,595

## ITERATION 123 #######################


> Neighbours evaluated; 52
> Selected Move:	13050	3	1	13	25000


> New Y[]: 
	
	 2  0  0  0  1  1  4  1  0  0  0  0  0  3  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 124 #######################


> Neighbours evaluated; 56
> Selected Move:	12750	3	5	15	25500


> New Y[]: 
	
	 2  0  0  0  1  0  4  1  0  0  0  0  0  3  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 125 #######################


> Neighbours evaluated; 57
> Selected Move:	12860	3	13	1	23800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 126 #######################


> Neighbours evaluated; 57
> Selected Move:	12860	4	6	4	25000


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,615

## ITERATION 127 #######################


> Neighbours evaluated; 52
> Selected Move:	12860	3	15	5	24500


> New Y[]: 
	
	 2  3  0  0  4  1  1  1  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,62

## ITERATION 128 #######################


> Neighbours evaluated; 52
> Selected Move:	12860	4	4	19	25000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0  0  0  0  0  0  0  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,615

## ITERATION 129 #######################


> Neighbours evaluated; 50
> Selected Move:	12798	4	19	7	25100


> New Y[]: 
	
	 2  3  0  0  1  1  1  4  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 130 #######################


> Neighbours evaluated; 53
> Selected Move:	12677	4	7	5	25300


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 131 #######################


> Neighbours evaluated; 48
> Selected Move:	12678	3	5	15	25300


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  0  0  4  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 132 #######################


> Neighbours evaluated; 52
> Selected Move:	12560	4	15	19	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 133 #######################


> Neighbours evaluated; 53
> Selected Move:	12767	3	19	13	25600


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  4  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 134 #######################


> Neighbours evaluated; 45
> Selected Move:	12830	2	15	-1	21100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,615

## ITERATION 135 #######################


> Neighbours evaluated; 49
> Selected Move:	12830	4	13	17	23100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  4  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,62

## ITERATION 136 #######################


> Neighbours evaluated; 52
> Selected Move:	12820	3	17	10	23500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  4  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,625

## ITERATION 137 #######################


> Neighbours evaluated; 62
> Selected Move:	12820	4	10	4	22500


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,63

## ITERATION 138 #######################


> Neighbours evaluated; 65
> Selected Move:	12820	4	4	6	21300


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,635

## ITERATION 139 #######################


> Neighbours evaluated; 64
> Selected Move:	12820	4	6	7	23100


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,63

## ITERATION 140 #######################


> Neighbours evaluated; 62
> Selected Move:	12820	4	7	13	21600


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  1  0  0  4  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,625

## ITERATION 141 #######################


> Neighbours evaluated; 76
> Selected Move:	12810	3	4	9	23600


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1  1  0  0  4  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,62

## ITERATION 142 #######################


> Neighbours evaluated; 68
> Selected Move:	12820	3	10	17	23100


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1  0  0  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,615

## ITERATION 143 #######################


> Neighbours evaluated; 57
> Selected Move:	12820	4	13	6	22800


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  0  1  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 144 #######################


> Neighbours evaluated; 58
> Selected Move:	12820	4	6	9	22900


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  4  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 145 #######################


> Neighbours evaluated; 62
> Selected Move:	12810	3	17	10	23400


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  4  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 146 #######################


> Neighbours evaluated; 70
> Selected Move:	12810	4	9	6	23300


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,595

## ITERATION 147 #######################


> Neighbours evaluated; 73
> Selected Move:	12780	3	10	8	24800


> New Y[]: 
	
	 2  3  0  0  0  0  4  1  1  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 148 #######################


> Neighbours evaluated; 52
> Selected Move:	12790	3	9	4	22800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 149 #######################


> Neighbours evaluated; 66
> Selected Move:	12790	4	6	4	24000


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 150 #######################


> Neighbours evaluated; 61
> Selected Move:	12790	4	4	7	24600


> New Y[]: 
	
	 2  3  0  0  1  0  1  4  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 151 #######################


> Neighbours evaluated; 53
> Selected Move:	12790	4	7	8	23300


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  4  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 152 #######################


> Neighbours evaluated; 62
> Selected Move:	12790	4	8	13	23100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0  0  0  0  4  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 153 #######################


> Neighbours evaluated; 73
> Selected Move:	12750	3	8	19	21600


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  4  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 154 #######################


> Neighbours evaluated; 56
> Selected Move:	12750	4	13	4	22500


> New Y[]: 
	
	 2  3  0  0  4  0  1  1  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 155 #######################


> Neighbours evaluated; 52
> Selected Move:	12750	4	4	6	21300


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 156 #######################


> Neighbours evaluated; 52
> Selected Move:	12870	1	-1	10	25800


> New Y[]: 
	
	 2  3  0  0  1  0  4  1  0  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 157 #######################


> Neighbours evaluated; 67
> Selected Move:	12710	4	6	13	26100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  1  0  0  4  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 158 #######################


> Neighbours evaluated; 73
> Selected Move:	12796	3	19	5	25600


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0  1  0  0  4  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 159 #######################


> Neighbours evaluated; 70
> Selected Move:	12729	3	10	19	25600


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0  0  0  0  4  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 160 #######################


> Neighbours evaluated; 58
> Selected Move:	12542	3	13	17	25600


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0  0  0  0  0  0  0  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 161 #######################


> Neighbours evaluated; 74
> Selected Move:	12340	3	6	14	24600


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0  0  0  0  0  1  0  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 162 #######################


> Neighbours evaluated; 66
> Selected Move:	12520	3	17	13	24600


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0  0  0  0  4  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 163 #######################


> Neighbours evaluated; 57
> Selected Move:	12735	3	5	10	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  0  4  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 164 #######################


> Neighbours evaluated; 83
> Selected Move:	12735	3	14	11	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  1  0  4  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 165 #######################


> Neighbours evaluated; 76
> Selected Move:	12717	3	19	14	25600


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  1  0  4  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 166 #######################


> Neighbours evaluated; 68
> Selected Move:	12660	3	14	17	24600


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 167 #######################


> Neighbours evaluated; 75
> Selected Move:	12780	3	10	5	24100


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0  0  1  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 168 #######################


> Neighbours evaluated; 45
> Selected Move:	12780	3	5	15	24600


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  1  0  4  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 169 #######################


> Neighbours evaluated; 40
> Selected Move:	12780	4	13	11	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  4  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 170 #######################


> Neighbours evaluated; 47
> Selected Move:	12660	3	15	10	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  4  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 171 #######################


> Neighbours evaluated; 77
> Selected Move:	12652	3	10	6	26500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  4  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 172 #######################


> Neighbours evaluated; 35
> Selected Move:	12600	3	6	3	26500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0  0  4  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 173 #######################


> Neighbours evaluated; 35
> Selected Move:	12517	3	3	12	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  4  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 174 #######################


> Neighbours evaluated; 20
> Selected Move:	12743	4	11	13	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  1  1  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 175 #######################


> Neighbours evaluated; 29
> Selected Move:	12802	3	11	14	25100


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  1  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 176 #######################


> Neighbours evaluated; 41
> Selected Move:	12742	3	14	6	26100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  1  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 177 #######################


> Neighbours evaluated; 29
> Selected Move:	12771	3	12	18	25100


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  4  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 178 #######################


> Neighbours evaluated; 92
> Selected Move:	12656	3	18	10	25600


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  1  0  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,595

## ITERATION 179 #######################


> Neighbours evaluated; 78
> Selected Move:	12490	3	6	14	24600


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  1  0  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 180 #######################


> Neighbours evaluated; 87
> Selected Move:	12610	3	10	5	24100


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0  0  0  0  4  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 181 #######################


> Neighbours evaluated; 52
> Selected Move:	12610	4	13	4	25000


> New Y[]: 
	
	 2  3  0  0  4  1  0  1  0  0  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 182 #######################


> Neighbours evaluated; 45
> Selected Move:	12675	3	5	19	25500


> New Y[]: 
	
	 2  3  0  0  4  0  0  1  0  0  0  0  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,615

## ITERATION 183 #######################


> Neighbours evaluated; 52
> Selected Move:	12900	3	4	2	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,62

## ITERATION 184 #######################


> Neighbours evaluated; 69
> Selected Move:	12900	3	14	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,625

## ITERATION 185 #######################


> Neighbours evaluated; 78
> Selected Move:	12720	3	17	18	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,62

## ITERATION 186 #######################


> Neighbours evaluated; 57
> Selected Move:	12850	3	3	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,615

## ITERATION 187 #######################


> Neighbours evaluated; 65
> Selected Move:	12650	3	7	17	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,61

## ITERATION 188 #######################


> Neighbours evaluated; 94
> Selected Move:	12870	3	6	11	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,605

## ITERATION 189 #######################


> Neighbours evaluated; 95
> Selected Move:	12700	3	19	12	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 190 #######################


> Neighbours evaluated; 67
> Selected Move:	12690	3	17	10	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,595

## ITERATION 191 #######################


> Neighbours evaluated; 74
> Selected Move:	12620	3	10	19	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,59

## ITERATION 192 #######################


> Neighbours evaluated; 39
> Selected Move:	12580	3	12	10	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,585

## ITERATION 193 #######################


> Neighbours evaluated; 87
> Selected Move:	12710	3	18	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,58

## ITERATION 194 #######################


> Neighbours evaluated; 83
> Selected Move:	12660	3	11	14	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 195 #######################


> Neighbours evaluated; 79
> Selected Move:	12690	3	19	7	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 196 #######################


> Neighbours evaluated; 74
> Selected Move:	12560	3	4	18	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 197 #######################


> Neighbours evaluated; 97
> Selected Move:	12677	3	10	8	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,56

## ITERATION 198 #######################


> Neighbours evaluated; 80
> Selected Move:	12530	3	18	4	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,555

## ITERATION 199 #######################


> Neighbours evaluated; 60
> Selected Move:	12557	3	7	11	26500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 200 #######################


> Neighbours evaluated; 77
> Selected Move:	12570	3	8	19	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 201 #######################


> Neighbours evaluated; 77
> Selected Move:	12470	3	4	17	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 202 #######################


> Neighbours evaluated; 87
> Selected Move:	12590	3	14	9	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 203 #######################


> Neighbours evaluated; 68
> Selected Move:	12498	3	19	14	26500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 204 #######################


> Neighbours evaluated; 51
> Selected Move:	12550	3	9	7	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 205 #######################


> Neighbours evaluated; 50
> Selected Move:	12550	3	14	4	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 206 #######################


> Neighbours evaluated; 47
> Selected Move:	12580	3	7	10	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 207 #######################


> Neighbours evaluated; 86
> Selected Move:	12640	3	11	3	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 208 #######################


> Neighbours evaluated; 77
> Selected Move:	12665	3	17	19	25500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 209 #######################


> Neighbours evaluated; 75
> Selected Move:	12578	3	10	7	25500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 210 #######################


> Neighbours evaluated; 55
> Selected Move:	12530	4	2	3	21600


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 211 #######################


> Neighbours evaluated; 66
> Selected Move:	12610	3	19	17	21100


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 212 #######################


> Neighbours evaluated; 57
> Selected Move:	12610	4	3	4	22000


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 213 #######################


> Neighbours evaluated; 58
> Selected Move:	12610	4	4	7	22600


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 214 #######################


> Neighbours evaluated; 57
> Selected Move:	12610	4	7	13	21100


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0  0  0  0  4  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515
________________________________________________________________

Best solution found: 13300
Run Termination time: 03.02.2010 22:13:20
Run duration: 00:02:32.5468750
________________________________________________________________
